Kim Smith (model)

Kimberley Katherine "Kim" Smith (born March 3, 1983) is a former American fashion model and actress.

Kim Smith
Born (1983-03-03) March 3, 1983
Odessa, Texas, U.S.
Modeling information
Height5 ft 9 in (1.75 m)
Hair colorBrown
Eye colorGreen

Early life and education

Smith was born in Houston. A graduate of Permian High School in Odessa, Texas, she got her big break into modeling when she accompanied a friend to a Model Search of America contest. She was changed from a spectator to a competitor by the head of the contest, and soon after signed with Clipse Management of Dallas. Her face and figure have been featured for Victoria's Secret, Mac and Jac, Abercrombie & Fitch, Harper's Bazaar, and Andrew Marc. She also took part in two of Paul Marciano's Guess campaigns in 2000.

Career

Smith has appeared in several music videos, including NSYNC's "Bye Bye Bye" and "It's Gonna Be Me", Aerosmith's "Girls of Summer" and Maroon 5's "Wake Up Call". She entered the film business in 2002 with a cameo in Van Wilder as comely coed Casey, and followed with a small role in 2004's Catwoman as model Drina.

Smith appeared in the July 2005 issue of Maxim magazine, which was dedicated to American troops serving overseas. Kim posed with American military regalia including dog tags and a camouflage hat; the article and pictures are featured in the Girls of Maxim Gallery. The publication named her #91 in its 2006 list.[1]

In 2007, Smith played a recurring role in the television series Friday Night Lights, based on the book of the same name, about the real-life Permian High School Panthers football team. Permian High School is Smith's Alma Mater.

Filmography

Film

Year Title Role Notes
2002 Van Wilder Casey
2004 Catwoman Drina
2009 Alternative Ending Model Short film

Television

Year Title Role Notes
2007 Friday Night Lights Lauren Davis 3 episodes
2009 Roommates Jennifer Episode: "The Old and the New"
2011 Romantically Challenged Nina Episode: "Perry Dates His Assistant" (unaired)

Music videos

Year Title Artist(s) Ref.
2000 "Bye Bye Bye" NSYNC [2]
"It's Gonna Be Me" [3]
2002 "Girls of Summer" Aerosmith [4]
2007 "Wake Up Call" (Original and Director's Cut versions) Maroon 5 [5][6]
gollark: Hold on, I can probably make a much nicer one.
gollark: It's kind of bad.
gollark: ```python#!/bin/env python3chars = [chr(n) for n in range(126)]firstchar = chars[0]lastchar = chars[len(chars) - 1]def increment_char(character): return chr(ord(character) + 1)def old_increment_string(string_to_increment): reversed_string = list(reversed(string_to_increment)) # Reverse the string for easier work. for rindex, char in enumerate(reversed_string): if char == lastchar: # If we can't increment this char further, try the next ones. reversed_string[rindex] = firstchar # Set the current char back to the first one. reversed_string[rindex + 1] = increment_char(reversed_string[rindex + 1]) # Increment the next one along. else: # We only want to increment ONE char, unless we need to "carry". reversed_string[rindex] = increment_char(reversed_string[rindex]) break return ''.join(list(reversed(reversed_string)))def increment_string(to_increment): reversed_string = list(to_increment) # Reverse the string for easier work. for rindex, char in enumerate(reversed_string): if char == lastchar: # If we can't increment this char further, try the next ones. reversed_string[rindex] = firstchar # Set the current char back to the first one. reversed_string[rindex + 1] = increment_char(reversed_string[rindex + 1]) # Increment the next one along. else: # We only want to increment ONE char, unless we need to "carry". reversed_string[rindex] = increment_char(reversed_string[rindex]) break return ''.join(list(reversed_string))def string_generator(): length = 0 while 1: length += 1 string = chars[0] * length while True: try: string = increment_string(string) except IndexError: # Incrementing has gone out of the char array, move onto next length break yield string```
gollark: Except it enumerates all possible ASCII strings instead.
gollark: I made that!

References

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.